Discretization-aware architecture search
نویسندگان
چکیده
The search cost of neural architecture (NAS) has been largely reduced by differentiable and weight-sharing methods. Such methods optimize a super-network with all possible edges operations, determine the optimal sub-network discretization, i.e., pruning off operations/edges small weights. However, discretization process performed on either operations or incurs significant inaccuracy thus quality is not guaranteed. In this paper, we propose discretization-aware (DA2S), target at pushing towards configuration desired topology. DA2S implemented an entropy-based loss term, which can be regularized to in plug-and-play fashion. regularization controlled elaborated continuation functions, so that adaptive dynamic change operations. Experiments standard image classification benchmarks demonstrate effectiveness our approach, particular, under imbalanced network configurations were studied before. Code available github.com/sunsmarterjie/DAAS.
منابع مشابه
Search-Based Class Discretization
We present a methodology that enables the use of classification algorithms on regression tasks. We implement this method in system RECLA that transforms a regression problem into a classification one and then uses an existent classification system to solve this new problem. The transformation consists of mapping a continuous variable into an ordinal variable by grouping its values into an appro...
متن کاملAn architecture for diversity-aware search for medical web content.
OBJECTIVES The Web provides a huge source of information, also on medical and health-related issues. In particular the content of medical social media data can be diverse due to the background of an author, the source or the topic. Diversity in this context means that a document covers different aspects of a topic or a topic is described in different ways. In this paper, we introduce an approac...
متن کاملPruning the Optimization Search Space Using Architecture-aware Cost Models⋆
In recent years, a number of strategies have emerged for empirically tuning applications to different architectures. Although quite successful for certain domains, empirical tuning is yet to gain wide acceptance as a viable strategy in high-performance computing. The principal bottleneck in this regard is the prohibitively large search space that needs to be explored in order to discover the be...
متن کاملAction-Based Discretization for AI Search
As computer gaming reaches ever-greater heights in realism, we can expect the complexity of simulated dynamics to reach further as well. To populate such gaming environments with agents that behave intelligently, there must be some means of reasoning about the consequences of agent actions. Such ability to seek out the ramifications of various possible action sequences, commonly called “lookahe...
متن کاملArchitecture Aware Partitioning Algorithms
Existing partitioning algorithms provide limited support for load balancing simulations that are performed on heterogeneous parallel computing platforms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes into account the available resources (CPU speed, network bandwidth). With heterogeneous technologies becoming more popul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2021
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2021.108186